Simple games on closure spaces
نویسندگان
چکیده
منابع مشابه
Simple games on closure spaces
Let N be a ...nite set. By a closure space we mean the family of the closed sets of a closure operator on 2 satisfying the additional condition ; = ;. A simple game on a closure space L is a function v : L ! f0; 1g such that v(;) = 0 and v (N) = 1. We assume simple games are monotonic. The coalitions are the closed sets of L and the players are the elements i 2 N . We will give results concerni...
متن کاملClosure spaces and restricted games
We study a cooperation structure in which the feasible coalitions are those belonging to a partition closure system. First, we develop the relation between the dividends of Harsanyi in the restricted game and the worth function in the original game. Next, we obtain an method for computing the Shapley and Banzhaf values of the closure-restricted games using the dividends formula. Finally, we ana...
متن کاملON (L;M)-FUZZY CLOSURE SPACES
The aim of this paper is to introduce $(L,M)$-fuzzy closurestructure where $L$ and $M$ are strictly two-sided, commutativequantales. Firstly, we define $(L,M)$-fuzzy closure spaces and getsome relations between $(L,M)$-double fuzzy topological spaces and$(L,M)$-fuzzy closure spaces. Then, we introduce initial$(L,M)$-fuzzy closure structures and we prove that the category$(L,M)$-{bf FC} of $(L,M...
متن کاملGames on Cellular Spaces
In this work we propose a new model for spatial games. We present a definition of mobility in terms of the satisfaction an agent has with its spatial location. Agents compete for space through a non-cooperative game by using mixed strategies. We are particularly interested in studyig the relation between Nash equilibrium and the winner strategy of a given model with mobility, and how the mobili...
متن کاملViolator spaces vs closure spaces
Violator Spaces were introduced by J. Matoušek et al. in 2008 as generalization of Linear Programming problems. Convex geometries were invented by Edelman and Jamison in 1985 as proper combinatorial abstractions of convexity. Convex geometries are defined by antiexchange closure operators. We investigate an interrelations between violator spaces and closure spaces and show that violator spaces ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Top
سال: 2000
ISSN: 1134-5764,1863-8279
DOI: 10.1007/bf02564827